t-HGSP: Hypergraph Signal Processing Using t-Product Tensor Decompositions
نویسندگان
چکیده
Graph signal processing (GSP) techniques are powerful tools that model complex relationships within large datasets, being now used in a myriad of applications different areas including data science, communication networks, epidemiology, and sociology. Simple graphs can only pairwise among which prevents their application modeling networks with higher-order relationships. For this reason, some efforts have been made to generalize well-known graph more such as hypergraphs, allow capturing data. In paper, we provide new hypergraph framework (t-HGSP) based on novel tensor-tensor product algebra has emerged tool for preserving the intrinsic structures tensors. The proposed allows generalization traditional GSP while keeping dimensionality characteristic systems represented by hypergraphs. To end, core elements t-HGSP introduced, shifting operators signal. Fourier space is also defined, followed concept bandlimited signals sampling. our experiments, demonstrate benefits approach clustering denoising.
منابع مشابه
Tensor Decompositions for Signal Processing Applications
The widespread use of multi-sensor technology and the emergence of big datasets has highlighted the limitations of standard flat-view matrix models and the necessity to move towards more versatile data analysis tools. We show that higher-order tensors (i.e., multiway arrays) enable such a fundamental paradigm shift towards models that are essentially polynomial and whose uniqueness, unlike the ...
متن کاملRevisiting Brauer’s formula for tensor product decompositions
The notation used here will be explained below. A familiar (though oversimplified) example is given for the Lie algebra sl2(C) by the Clebsch– Gordan formula; as in [2, Exer. 22.7]. In 1937 Richard Brauer published a short note giving a general formula of this sort. It still serves as the starting point for some computer methods, even though it usually involves a large number of cancellations. ...
متن کاملVLSI Circuit Design of Digital Signal Processing Algorithms Using Tensor Product Formulation
Abstract Many important computation problems can be specified by block recursive algorithms. For example, matrix transposition and fast Fourier transform are block recursive algorithms. In this paper, we present a methodology of VLSI circuit design for block recursive algorithms based on the tensor product theory. Matrix transposition and fast Fourier transform algorithms are designed and imple...
متن کاملMultidimensional Signal Processing Methods: Target Detection Methods Based on Tensor Decompositions
Reducing noise is an important preprocessing step for further analyze the information in the hyperspectral image (HSI). Commonly, filtering methods for HSIs are based on the data vectorization or matricization while ignore the related information between different bands. So there are new approaches considering multidimensional data as whole entities based on tensor decomposition. However, it ca...
متن کاملWavelet-Based Decompositions for Nonlinear Signal Processing
Nonlinearities are often encountered in the analysis and processing of real-world signals. This paper develops new signal decompositions for nonlinear analysis and processing. The theory of tensor norms is employed to show that wavelets provide an optimal basis for the nonlinear signal decompositions. The nonlinear signal decompositions are also applied to signal processing problems.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal and Information Processing over Networks
سال: 2023
ISSN: ['2373-776X', '2373-7778']
DOI: https://doi.org/10.1109/tsipn.2023.3276687